Segmenting image signals for encoding using quantization analysis

ABSTRACT

A cell of an image is segmented into two or more subcells. According to one embodiment, the nullity of each of the subcells is classified and the cell is encoded in accordance with the nullity of the subcells. According to another embodiment, the quantization level of each of the subcells is classified and the cell is encoded in accordance with the quantization levels of the subcells.

CROSS-REFERENCES TO RELATED APPLICATIONS

This is a continuation of copending application Ser. No. 08/119,438, filed on Sep. 9, 1993, which is a continuation-in-part of copending application Ser. No. 08/078,931, filed on Jun. 16, 1993.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to image signal processing, and, in particular, to systems for reducing the amount of digital data required to represent a digital image signal to facilitate uses, for example, such as the transmission, recording, and reproduction of the digital image signal.

2. Description of the Related Art

Conventional systems for playing video in a PC environment are limited, in part, by the processing capabilities of the PC processors. These limitations include low video frame rates and small video window sizes for display of video images. Such limitations result in low video quality. As a result, some conventional systems for playing video in a PC environment require additional hardware that is designed to process video data at the rates needed to provide acceptable video quality.

It is, therefore, desirable to provide a playback video system for displaying high-quality, full-motion digital video images on a graphics display monitor in a personal computer (PC) environment that does not require any additional hardware. Such a playback video system is preferably capable of performing decoding and display functions to support playback mode. In playback mode, the playback video system accesses encoded video data from a mass storage device, decodes the data, and displays the decoded data on a display monitor.

It is also desirable to provide a compression video system for generating the encoded video data that will be decoded and displayed by the playback video system. Such a compression video system is preferably capable of performing capture, encoding, decoding, and display functions to support both a compression mode and the playback mode. In compression mode, the compression video system captures and encodes video images generated by a video generator, such as a video camera, VCR, or laser disc player. The encoded video data may then be stored to a mass storage device, such as a hard drive or, ultimately, a CD-ROM. At the same time, the encoded video data may also be decoded and displayed on a display monitor to monitor the compression-mode processing.

It is accordingly an object of this invention to overcome the disadvantages and drawbacks of the known art and to provide a playback video system for displaying high-quality, full-motion video images in a PC environment.

It is a further object of this invention to provide a compression video system for generating the encoded video data to be decoded and displayed by the playback video system.

It is a particular object of the present invention to provide a playback video system for displaying video images under a multi-media operating system running on a personal computer with a general-purpose processor.

Further objects and advantages of this invention will become apparent from the detailed description of a preferred embodiment which follows.

SUMMARY OF THE INVENTION

The present invention is a computer-implemented process and apparatus for encoding image signals. According to a preferred embodiment, a cell of an image is provided and segmented into two or more subcells. The nullity of each of the subcells is classified and the cell is encoded in accordance with the nullity of the subcells.

The present invention is also a computer-implemented process and apparatus for decoding encoded image signals. According to a preferred embodiment, encoded image signals corresponding to a cell of an image are provided and the encoded image signals are decoded, wherein the cell having been encoded by segmenting the cell into two or more subcells; classifying the nullity of each of the subcells; and encoding the cell in accordance with the nullity of the subcells.

The present invention is also a computer-implemented process and apparatus for encoding image signals. According to a preferred embodiment, a cell of an image is provided and segmented into two or more subcells. The quantization level of each of the subcells is classified and the cell is encoded in accordance with the quantization levels of the subcells.

The present invention is also a computer-implemented process and apparatus for decoding encoded image signals. According to a preferred embodiment, encoded image signals corresponding to a cell of an image are provided and the encoded image signals are decoded, wherein the cell having been encoded by segmenting the cell into two or more subcells; classifying the quantization level of each of the subcells; and encoding the cell in accordance with the quantization levels of the subcells.

BRIEF DESCRIPTION OF THE DRAWINGS

Other objects, features, and advantages of the present invention will become more fully apparent from the following detailed description of a preferred embodiment, the appended claims, and the accompanying drawings in which:

FIG. 1 is a block diagram of a video system for displaying video images in a PC environment, according to a preferred embodiment of the present invention;

FIG. 2 depicts the syntax of the encoded video bitstream of the video system of FIG. 1;

FIG. 3 depicts the syntax of the video bitstream header of the video bitstream of FIG. 2;

FIG. 4 depicts the syntax of the flags field of the video bitstream header of FIG. 3;

FIG. 5 depicts the syntax of each of the Y-, U-, and V-component data fields of the video bitstream header of FIG. 3;

FIG. 6 presents the pseudo-code for a preferred embodiment of the real-time encoder of the video system of FIG. 1;

FIGS. 7a-7g present the pseudo-code for a preferred embodiment of the decoder of the video system of FIG. 1;

FIG. 8 is a process flow diagram of the processing implemented by the video system of FIG. 1 to encode video data using the non-real-time encoder;

FIG. 9 is a process flow diagram of the processing implemented by the non-real-time encoder of the video system of FIG. 1 to encode each frame of YUV9 video data;

FIGS. 10 and 11 are the first and second parts, respectively, of the bit rate controller implemented by the non-real-time encoder of the video system of FIG. 1 to control compressed frame bit rates;

FIG. 12 is a process flow diagram of the processing implemented by the non-real-time encoder of the video system of FIG. 1 to encode each component plane of a delta frame;

FIG. 13 is a process flow diagram of the processing implemented by the non-real-time encoder of the video system of FIG. 1 to encode a region of a component plane of a delta frame using inter-frame encoding;

FIG. 14 is a process flow diagram of the processing implemented by the non-real-time encoder of the video system of FIG. 1 to segment a strip of a component plane of the current frame into regions using motion analysis;

FIG. 15 is a process flow diagram of the processing implemented by the non-real-time encoder of the video system of FIG. 1 to segment a region of a component plane of the current frame into cells using quantization analysis;

FIG. 16 shows the seven different types of quadrant nullity that may exist in a cell;

FIG. 17 shows the six different types of quadrant quantizing that may exist in a cell;

FIG. 18 is a process flow diagram of the processing implemented by the non-real-time encoder of the video system of FIG. 1 to determine whether to split a cell vertically or horizontally during quantization analysis when either split is possible, but the four quadrants of the cell are not all larger than the minimum cell size; and

FIG. 19 is a process flow diagram of the processing implemented by the non-real-time encoder of the video system of FIG. 1 to encode each component plane of a key frame.

DESCRIPTION OF PREFERRED EMBODIMENT(S)

Description of Video System

Referring now to FIG. 1, there is shown a block diagram of a video system 100 for displaying video images in a PC environment, according to a preferred embodiment of the present invention. Video system 100 is capable of performing in the compression and playback modes. The operations of video system 100 are controlled by operating system 112 which communicates with the other processing engines of video system 100 via system bus 120.

When video system 100 operates in compression mode, video generator 102 of video system 100 generates analog video signals and transmits those signals to capture processor 104. Capture processor 104 decodes (i.e., separates) the analog video signal into three linear components (one luminance component Y and two chrominance components U and V), digitizes each component, and scales the digitized data. Scaling of the digitized data preferably includes subsampling the U and V data to generate digitized video data in subsampled YUV9 format. Those skilled in the art will understand that YUV9 data has one U-component value and one V-component value for every (4×4) block of Y-component values.

Real-time encoder 106 encodes (i.e., compresses) each component of the captured (i.e., unencoded or uncompressed) YUV9 data separately and transmits the encoded data as a video bitstream via system bus 120 for storage to mass storage device 108. The syntax of the video bitstream is described in further detail later in this specification in conjunction with FIGS. 2-5.

The encoded data may then be optionally further encoded by non-real-time (NRT) encoder 110. If such further encoding is selected, then NRT encoder 110 accesses the encoded video-bitstream data stored in mass storage device 108, encodes the data further, and transmits the further encoded video data back to mass storage device 108. The output of NRT encoder 110 is further encoded video data that follows the same video-bitstream syntax as the encoded video data generated by real-time encoder 106.

Video system 100 also provides optional monitoring of the compression-mode processing. If such monitoring is selected, then, in addition to being stored to mass storage device 108, the encoded video bitstream (generated by either real-time encoder 106 or non-real-time encoder 110) is decoded (i.e., decorepressed) back to YUV9 format (and scaled for display) by decoder 114. Color converter 116 then converts the decoded, scaled YUV9 data to a display format selected for displaying the video images on display monitor 118. The display format is preferably selected to be either CLUT8 or RGB24 format, depending on the requirements of display monitor 118, although alternative embodiments of the present invention may support additional or alternative display formats.

When video system 100 operates in the playback mode, decoder 114 accesses video data in the encoded video-bitstream format stored in mass storage device 108 and decodes and scales the encoded data back to decoded YUV9 format. Color converter 116 then converts the decoded, scaled YUV9 data to a selected display format for display on display monitor 118.

Those skilled in the art will understand that, depending on the modes to be supported, some of the components of video system 100 as depicted in FIG. 1 may be considered optional. For example, in compression mode, decoder 114, color converter 116, and display monitor 118 are optional, if compression-mode monitoring is not selected. Similarly, in play-back mode, video generator 102, capture processor 104, real-time encoder 106, and non-real-time encoder 110 are optional.

In a preferred embodiment, operating system 112 is a multi-media operating system, such as, but not limited to, Microsoft® Video for Windows or Apple® QuickTime, running on a personal computer with a general-purpose processor, such as, but not limited to, an Intel® x86 or Motorola® microprocessor. An Intel® x86 microprocessor may be an Intel® 386, 486, or Pentium™ processor. Video generator 102 may be any source of analog video signals, such as a video camera, VCR, or laser disc player. Capture processor 104 and real-time encoder 106 are preferably implemented by a video processor such as an Intel® i750 encoding engine on an Intel® Smart Video Board. Non-real-time encoder 110 is preferably implemented in software running on the general-purpose processor.

Mass storage device 108 may be any suitable device for storing digital data, such as a hard drive or a CD-ROM. Those skilled in the art will understand that video system 100 may have more than one mass storage device 108. For example, video system 100 may have a hard drive for receiving encoded video-bitstream data generated during compression mode and a CD-ROM for storing other encoded video-bitstream data for playback mode.

Decoder 114 and color converter 116 are preferably implemented in software running on the general-purpose processor. Display monitor 118 may be any suitable device for displaying video images and is preferably a graphics monitor such as a VGA monitor.

Those skilled in the art will understand that each of the functional processors of video system 100 depicted in FIG. 1 may be implemented by any other suitable hardware/software processing engine.

Overview of Video Encoding Process

Video system 100 encodes each component plane of YUV9 video data separately. Each component plane is segmented into regions using binary-tree image segmentation. Each region is encoded based on adaptive two-phase vector quantization with either intraframe prediction or interframe (i.e., delta) prediction. Each region may also be encoded using motion estimation (preferably at whole-pixel increments). Each region of a component plane may be encoded using different vector-quantization tables and/or different motion-estimation vectors from other regions of that component plane. A region is encoded in units of (4×4) blocks in raster order, with the Y-, U-, and V-component data preferably encoded as 7-bit values.

Every pixel in a region is predicted. If the region is an "intra" region, then pixels are encoded based on the difference D between vertically adjacent pixels in the same frame, such that:

    D=pixel(n,x,y)-pixel(n,x,y-1),

where n is the frame number, x is the column number, and y is the row number. If the region is an "inter" or delta region, then pixels are encoded based on the difference D between corresponding pixels in successive frames taking into account any motion estimation, such that:

    D=pixel(n,x,y)-pixel(n-1,x+dx,y+dy),

where (dx,dy) are the components of the motion estimation vector.

Each region may be encoded using up to two different vector-quantization (VQ) tables: a primary VQ table and a secondary VQ table. A region may be encoded in any one of thirteen different encoding modes, as presented in Table I.

                                      TABLE 1                                      __________________________________________________________________________     Video Encoding Algorithm Modes                                                 MODES                                                                          Row                                                                               0 1 2 3 4  5 6 7  8 9 10A                                                                               10B 11                                                                               12                                           __________________________________________________________________________     1  P S S X X  Z Z π                                                                              σ                                                                          σ                                                                          0  PP  P P                                            2  P P P P P  P P π                                                                              π                                                                             π                                                                             PP PP  p P                                            3  P S S X X  Z Z π                                                                              σ                                                                          σ                                                                          0  QQ  Q S                                            4  P P S P S  P S π                                                                              π                                                                             σ                                                                          QQ PP  Q S                                            __________________________________________________________________________

The modes of Table I describe how each row of each (4×4) block of a region is encoded. The letter "P" denotes that the primary VQ table is used for the corresponding row. The letter "S" denotes that the secondary VQ table is used. The letter "X" denotes that no corrections are applied and that the pixel values are generated by interpolation. The letter "Z" denotes that interpolation is performed, and, if the next two-bit code has a value of "1", then an "S" correction is performed. The letter "π" denotes that a "P" correction is applied with 2-bit codes to indicate if one or two dyads or a quad is to be used. The letter "σ" denotes that an "S" correction is applied with two-bit codes to indicate if one or two dyads or a quad is to be used. For example, in mode 1, the first and third rows of each (4×4) block of the region are encoded using the secondary VQ table, while the second and fourth rows are encoded using the primary VQ table.

Mode 10A applies to "intra" cells and mode 10B applies to "inter" cells. In mode 10A, the zero corrector is applied to the first and third rows, a corrector from the primary VQ table is applied twice horizontally to the second row, and a different corrector from the primary VQ table is applied twice horizontally to the fourth row. In mode 10B, a corrector from the primary VQ table is applied twice horizontally and twice vertically to the first and second rows, and a different corrector from the primary VQ table is applied twice horizontally and twice vertically to the third and fourth rows. In mode 11, a corrector from the primary VQ table is applied twice vertically to the first and second rows, and a different corrector from the primary VQ table is applied twice vertically to the third and fourth rows. In mode 12, a corrector from the primary VQ table is applied twice vertically to the first and second rows, and a different corrector from the secondary VQ table is applied twice vertically to the third and fourth rows. Pixels in each (4×4) block are encoded in (2×1) dyads in the following order: ##STR1## There are 256 different byte codes for encoding the dyads. These 256 byte codes fall into the following six categories:

(1) apply dyad N;

(2) apply two dyads (i.e., a quad);

(3) apply 4, 6, or 8 consecutive zero-valued dyads;

(4) apply zero-valued dyads to n blocks;

(5) skip n blocks; and

(6) apply absolute value to whole block (i.e., "monotone").

The following is the assembler language inner loop for modes 0, 1, or 2 of Table I:

    ______________________________________                                         mov dl,gs:[ebp + K]                                                                               ; get next data byte                                        mov eax, es:[edx*4 + C]                                                                           ; get VQ delta                                              add eax,[esi + M*PITCH]                                                                           ; add to prediction                                         jns quadN          ; speedup common case                                       mov dl,jmpidx[edx] ; select action for                                         jmp jmptableN[edx] ; arbitrary case                                            quadN:                                                                         mov [edi + D*PITCH],eax                                                                           ; store 4 pixels                                            {repeat the above in unrolled loop}                                            ______________________________________                                    

The results of encoding each block of each region of each component plane of each frame of video data are organized according the video bitstream syntax, which is described in the next section.

Referring now to FIG. 6, there is presented the pseudo-code for a preferred embodiment of real-time encoder 106 of video system 100 of FIG. 1. The pseudo-code is preferably implemented in assembly language on a general-purpose microprocessor or special-purpose video processor. In order to meet the constraints of real-time encoding, real-time encoder 106 preferably does not use all the features of the bitstream syntax of video system 100. Those skilled in the art will understand that non-real-time encoder 114 preferably uses more features of the bitstream syntax to produce more highly compressed bitstreams, for example, by using motion estimation to determine the optimum predicted cell for inter cells. Real-time encoder 106 preferably uses only intra cells. The "overflow condition" referred to in the pseudo-code of FIG. 6 tests whether both resulting 7-bit pixel values are strictly between the values 8 and 120, when adding a dyad corrector to a prediction.

Referring now to FIGS. 7a-7g, there is presented the pseudo-code for a preferred embodiment of decoder 114 of video system 100 of FIG. 1. The pseudo-code is preferably implemented in assembly language on a general-purpose processor or any processor capable of real-time decoding. All pixels in all three component planes (i.e, Y, V, and U) are preferably 7-bit values with Y constrained to be within 8 and 120.

Description of Video Bitstream Syntax

Referring now to FIG. 2, there is shown a representation of a preferred syntax of the encoded video bitstream 200 corresponding to one frame of video data. Video bitstream 200 is generated by real-time encoder 106 and non-real-time encoder 110, and is decoded by decoder 114 of video system 100 of FIG. 1. Each frame of video data in video bitstream 200 includes OPERATING SYSTEM header 202, VIDEO BITSTREAM header 204, U-COMPONENT DATA field 206, V-COMPONENT DATA field 208, and Y-COMPONENT DATA field 210.

Multi-media operating systems typically support several types of encoding/decoding processes. OPERATING SYSTEM header 202 of the video bitstream 200 informs operating system 112 of video system 100 that the video bitstream 200 is to be decoded using the decoding process implemented by decoder 114 of video system 100 of FIG. 1. In general, OPERATING SYSTEM header 202 contains information required by the particular multi-media operating system of video system 100.

Referring now to FIG. 3, there is shown a representation of a preferred syntax of VIDEO BITSTREAM header 204 of video bitstream 200 of FIG. 2. VIDEO BITSTREAM header 204 is a forty-eight-byte field.

VERSION NUMBER 302 of VIDEO BITSTREAM header 204 is a two-byte integer field that identifies the decoding process version number used to create the current data frame. VERSION NUMBER 302 preferably has a decimal value of 32.

Referring now to FIG. 4, there is shown a representation of a preferred syntax of FLAGS 304 of VIDEO BITSTREAM header 204 of FIG. 3. FLAGS 304 is a two-byte unsigned field.

BS₋₋ STILL₋₋ PERIOD 402 is bit 0 (the least significant bit (LSB)) of FLAGS 304. BS₋₋ STILL₋₋ PERIOD 402 denotes whether the current frame is a periodic still frame (i.e., a periodic key frame). If BS₋₋ STILL₋₋ PERIOD 402 is 1, then the current frame is a periodic still frame.

BS₋₋ 8BIT 404 is bit 1 of FLAGS 304 and denotes whether the YUV-component data uses 8 bits or 7 bits. If BS₋₋ 8BIT 404 is 0, then the YUV-component data uses only 7 bits. In a preferred embodiment, the YUV-component data uses only 7 bits.

BS₋₋ STILL 406 is bit 2 of FLAGS 304 and denotes whether the current frame is a still frame (i.e., any type of key frame). If BS₋₋ STILL 406 is 1, then the current frame is a still frame.

BS₋₋ STILL₋₋ NEXT 4011 is bit 3 of FLAGS 304 and denotes whether the next frame is a still frame. If BS₋₋ STILL₋₋ NEXT 408 is 1, then the next frame is a still frame.

BS₋₋ MC₋₋ H₋₋ HALF 410 is bit 4 of FLAGS 304 and denotes whether the horizontal components of the motion compensation vectors for the current frame are in whole-pixel or half-pixel increments. In a preferred embodiment, the motion compensation vectors are in whole-pixel increments. A value of 0 for BS₋₋ MC₋₋ H₋₋ HALF 410 indicates whole-pixel increments.

BS₋₋ MC₋₋ V₋₋ HALF 412 is bit 5 of FLAGS 304 and denotes whether the vertical components of the motion compensation vectors for the current frame are in whole-pixel or half-pixel increments. In a preferred embodiment, the motion compensation vectors are in whole-pixel increments. A value of 0 for BS₋₋ MC₋₋ V₋₋ HALF 410 indicates whole-pixel increments.

BS₋₋ MC₋₋ OFF 414 is bit 6 of FLAGS 304 and denotes whether only the null motion compensation vector is used throughout the current frame. A value of 1 for BS₋₋ MC₋₋ OFF 414 indicates that only the null motion compensation vector is used.

Bit 7 of FLAGS 304 is reserved.

BS₋₋ DISPOSABLE 416 is bit 8 of FLAGS 304 and denotes whether the current frame is disposable. A value of 1 for BS₋₋ DISPOSABLE 416 indicates that the current frame is disposable.

BS₋₋ BUFFER 4111 is bit 9 of FLAGS 304 and denotes to which of two possible buffers to store the data for the current frame. It also therefore denotes which buffer contains the data for the previous frame (i.e., the other buffer), when the current frame is a delta frame. A value of 0 for BS₋₋ BUFFER 418 indicates that the current frame is to be stored to buffer 0; a value of 1 indicates buffer 1.

The unassigned bits of FLAGS 304 (i.e., bits 7 and 10-15) are reserved for future use and are set to zero.

Referring again to FIG. 3, DATA SIZE 306 of VIDEO BITSTREAM header 204 is a four-byte integer field that indicates the total number of bits in the encoded image. This value preferably includes the bitstream header information.

CB OFFSET 308 is a one-byte integer field that indicates a byte offset to apply to the addressed vector quantization (VQ) tables. Video system 100 preferably provides a vector set containing more than 16 different vector quantization tables that may be used during encoding. In a preferred embodiment, VQ tables 0 through 15 are designated to real-time encoder 106 and VQ tables 16 through 31 are designated to non-real-time encoder 110. In that preferred embodiment, when real-time encoder 106 generates a video bitstream, CB OFFSET 308 is set to a value of 0. When non-real-time encoder 110 generates a video bitstream, CB OFFSET 308 is set to a value of 16. For decoding of a particular video bitstream, decoder 114 adds CB OFFSET 308 to the VQ table pointers contained in ALT QUANT 326 to address the appropriate VQ tables.

RESERVED 310 is a one-byte reserved field.

CHECKSUM 312 is a two-byte unsigned field that provides a checksum value for the Y, U, and V planes. The value of CHECKSUM 312 is preferably generated by the encoder to be equal to the "exclusive OR" or "XOR" over all pairs of pixels in the three component planes of the decoded image. CHECKSUM 312 is preferably used only during debugging of video system 100.

IMAGE HEIGHT 314 is a two-byte integer field that indicates the number of pixels in each column of the Y-component plane.

IMAGE WIDTH 316 is a two-byte integer field that indicates the number of pixels in each row of the Y-component plane.

Y DATA OFFSET 318 is a four-byte integer field that indicates the offset in number of bytes from the start of the bitstream header to the beginning of the Y-COMPONENT DATA field 210.

V DATA OFFSET 320 is a four-byte integer field that indicates the offset in number of bytes from the start of the bitstream header to the beginning of the V-COMPONENT DATA field 208.

U DATA OFFSET 322 is a four-byte integer field that indicates the offset in number of bytes from the start of the bitstream header to the beginning of the U-COMPONENT DATA field 206.

RESERVED 324 is a four-byte reserved field.

ALT QUANT 326 is a sixteen-byte integer field, each byte of which indicates a pair of VQ tables that may be used in decoding the current frame. The high-order bits of each byte denote the "primary" VQ table, while the low-order bits denote the "secondary" VQ table.

Referring now to FIG. 5, there is shown a representation of DATA field 500, where DATA field 500 is a preferred syntax of each of U-, V-, and Y-COMPONENT DATA fields 206, 208, and 210 of video bitstream 200 of FIG. 2.

MC VECTOR COUNT 502 of DATA field 500 is four-byte integer field that denotes the number of different motion compensation (MC) vectors that were used to encode (and therefore that are to be used to decode) the current component data plane.

MC VECTORS 504 is a variable-length field that contains the motion compensation vectors used to encode (and to be used to decode) the current component data plane. There are as many entries in MC VECTORS 504 as the value of MC VECTOR COUNT 502. Each entry in MC VECTORS 504 is a two-byte signed MC vector field. The first byte read in the bitstream corresponds to the vertical component and the second byte read in the bitstream corresponds to the horizontal component of a motion compensation vector. When the motion compensation vectors are in whole-pixel increments, component values are the signed byte values. When the motion compensation vectors are in half-pixel increments, component values are the signed byte values divided by two. If the value of MC VECTOR COUNT 502 is zero, then there are no entries in MC VECTORS 504. MC VECTORS 504 may contain up to 256 two-byte MC vector fields.

ENCODED DATA 506 contains unsigned byte data that encodes the current component data plane. ENCODED DATA 506 comprises two-bit binary tree codes and eight-bit region codes. The binary tree codes indicate the segmentation of the current component data plane into regions for encoding. The region codes tell decoder 114 how to decode the encoded pixel data for the current region of a component data plane. ENCODED DATA 506, like MC VECTORS 504, is a variable-length field.

The two-bit binary tree codes are packed four to a byte. These binary-tree-code bytes are then interleaved with the eight-bit region codes. There are three different types of binary tree codes: MC-PHASE tree codes, VQ-PHASE tree codes, and NULL tree codes.

Decoding of an encoded bitstream involves two different phases: a motion-compensation phase and a vector-quantization phase. MC-PHASE tree codes apply during the motion-compensation phase and VQ-PHASE and NULL tree codes apply during the vector-quantization phase. The sequence of tree codes depends on the segmentation and encoding of the component plane.

A value of 0 for an MC-PHASE tree code implies a horizontal split, which means that the current region of the component data field is segmented horizontally into top and bottom halves.

A value of 1 for an MC-PHASE tree code implies a vertical split, which means that the current region of the component data field is segmented vertically into left and right halves.

A value of 2 for an MC-PHASE tree code means that the current region of the component data field is encoded like a key frame.

A value of 3 for an MC-PHASE tree code means that the current region of the component data field is encoded like a delta frame. In this case, motion compensation is performed relative to the previous frame. Such motion compensation is known as "inter-frame" compensation. In this case, the next byte in ENCODED DATA 506 of DATA field 500 of FIG. 1 contains the index for the appropriate motion compensation vector as tabulated in MC VECTORS 504 of DATA field 500 of FIG. 1.

After receiving an MC-PHASE tree code with a value of either 2 or 3, the vector-quantization phase of decoding is entered and the next two-bit binary tree code will be a VQ-PHASE tree code. A value of 0 for a VQ-PHASE tree code implies a horizontal split, which means that the current region of the component data field is segmented horizontally into top and bottom halves.

A value of 1 for a VQ-PHASE tree code implies a vertical split, which means that the current region of the component data field is segmented vertically into left and right halves.

A value of 3 for a VQ-PHASE tree code indicates that the next byte in ENCODED DATA 506 of DATA field 500 of FIG. 1 defines the corrector mode (the upper four bits) and the vector quantization table (the lower four bits) used to decode the current region of the component data field.

A value of 2 for a VQ-PHASE tree code indicates that the next two-bit binary tree code is a NULL tree code.

A value of 0 for a NULL tree code indicates that the corresponding region from the previous frame is to be copied into the current region of the current frame.

A value of 1 for a NULL tree code indicates that the data in the current region is to be left as it is (i.e., that the current region is a null region).

The values of 2 and 3 for a NULL tree code are reserved.

Interleaved with the binary-tree-code bytes in ENCODED DATA 506 for a region of the current component data plane are the region codes for that region. The region codes consist of a variable number of one-byte codes that describe how the pixels for the current region were encoded (and therefore how they are to be decoded).

The first byte of the set of region codes for a particular region contains, among other information, the region mode (i.e., the mode of Table I used to encode the current region). The rest of the bytes in the set of region codes are the byte codes (i.e., the encoded pixels for the current region).

Those skilled in the art will understand that encoded video data, encoded using the syntax of video bitstream 200, may be further encoded and transmitted as "further encoded" video data that is also encoded in the syntax of video bitstream 200. Non-real-time encoder 110 of video system 100 performs such further encoding on encoded video data generated by real-time encoder 106.

Non-Real-Time Encoder Processing

As described earlier in this specification in conjunction with FIG. 1, non-real-time (NRT) encoder 110 may be used to generate compressed video data that is encoded in the syntax of video bitstream 200.

Referring now to FIG. 8, there is shown a process flow diagram of the processing implemented by video system 100 to encode video data using NRT encoder 110, according to a preferred embodiment of the present invention. Video generator 102 of video system 100 of FIG. 1 generates an analog video signal (block 802 of FIG. 8) and capture processor 104 captures the analog video signal as captured digital YUV9 data (block 804). Real-time encoder 106 minimally encodes the YUV9 data in the syntax of video bitstream 200 (block 806) and stores the minimally encoded bitstream data to mass storage device 108 (block 808). Those skilled in the art will understand that, since, in this mode of operation of video system 100, NRT encoder 110 is to encode the video data, real-time encoder 106 only minimally encodes the video data to preserve as much of the original video data as possible for NRT encoder 100.

Decoder 114 then decodes the minimally encoded data (block 810) and stores the resulting decompressed YUV9 data back to mass storage device 108 (block 812). NRT encoder 110 encodes the decompressed YUV9 data in the syntax of video bitstream 200 (block 814) and stores the encoded bitstream data back to mass storage device 108 (block 816). The operations of decoder 114 and NRT encoder 110 may be performed off line (i.e., not in real time).

As depicted in FIG. 8, NRT encoder 110 encodes decompressed YUV9 video data (i.e., video data that has previously been encoded and decoded). Those skilled in the art will understand that, in other modes of operation, NRT encoder 110 may be used to encode uncompressed YUV9 video data (i.e., raw video data that has never been encoded). It will also be understood that alternative embodiments of non-real-time encoders within the scope of the present invention may be used to encode video data in formats other than YUV9.

Referring now to FIG. 9, there is shown a process flow diagram of the processing implemented by NRT encoder 110 to encode each frame of YUV9 video data (i.e., block 814 of FIG. 8). In a preferred embodiment of video system 100, there are two types of frames: key frames and delta frames. A delta frame is typically encoded with respect to a previous frame, while a key frame is encoded without respect to any previous frame.

In addition, there are two types of delta frames: predicted frames and disposable frames. A predicted frame is a delta frame that may be used as the reference frame for at least one subsequent delta frame, while a disposable frame is a delta frame that is not used as a reference for any other delta frames.

If a frame is a key frame, then each component plane of the frame is preferably encoded using intra-frame encoding (e.g., based on differences between adjacent pixels within the current frame). If a frame is a delta frame (i.e., either a predicted or disposable frame), then zero, one, or more regions of each component plane may be encoded using intra-frame encoding, while the other regions of the component plane are encoded using inter-frame encoding (e.g., based on differences between pixels of the current frame and pixels of a previous reference frame). It is possible for a component plane of a delta frame to be encoded using only inter-frame encoding or only intra-frame encoding.

NRT encoder 110 begins encoding a frame by implementing the first part of a bit rate controller (block 902 of FIG. 9). The purpose of the bit rate controller is to regulate compressed data rates. The bit rate controller regulates compressed data rates by adjusting the values of certain parameters that control the amount of compression performed by NRT encoder 110 to attempt to achieve a specified target compressed frame size for the current frame being encoded. In video system 100, the target compressed frame size depends on the type of frame being encoded (i.e., key frame, disposable frame, predicted frame). The bit rate controller is described in greater detail later in this specification in conjunction with FIGS. 10 and 11.

After implementing the first part of the bit rate controller, NRT encoder 110 applies a spatial filter to each frame of video data to increase the correlation between neighboring pixels of the frame (block 904). Increased correlation leads to reduced bit rates without appreciable degradation in perceptual quality of the video. In fact, if the original picture has noise, a moderate degree of filtering may improve the perceptual quality by filtering away most of the noise.

In a preferred embodiment, the spatial filter implemented by NRT encoder 110 is a modification of an edge preserving filter. An ordinary filter like a linear filter tends to blur edges within the image. An edge preserving filter is a filter in which neighboring pixels that have values widely different from the pixel being filtered are not included in the filtering. While preventing edges from being blurred, such a filter may lead to contouring when using coding schemes like vector quantization. To avoid contouring in video system 100, rather than ignore the contribution from widely different neighbors, NRT encoder 110 merely reduces their contribution.

A preferred spatial filter for NRT encoder 110 is a separable, five-tap filter applied both in the horizontal and vertical directions. Nominally, the weights of the five-tap filters are: w2, w1, 1, w1, and w2, where 1 is the weight for the central pixel. For a neighbor to contribute, it must satisfy the following criteria:

    (1-e) * c≦n≦(1+e) * c,                       (1)

where c is the value of the pixel being filtered (i.e., the center pixel of the filter), n is the value of the neighbor, and e is the edge thresholding parameter. If either of the two nearest neighbors do not satisfy the above constraint, then a weight w₋₋ alt (i.e., smaller than w1) is used as the weight for that neighbor. The preferred ranges of the weights and edge thresholding parameters are as follows:

    0.20≦w1≦0.33

    0.07≦w2≦0.10

    0.07≦w.sub.-- ale≦0.15

    0.05≦e≦0.27

In a preferred embodiment, key frames are specified on a periodic basis. For example, NRT encoder 110 may implement the following sequence for encoding frames: ##STR2## where K stands for key frame, D for disposable frame, and P for predicted frame. In this sequence, every eighth frame is a key frame, every even frame that is not a key frame is a predicted frame, and every other frame is a disposable frame. Those skilled in the art will understand that frame 0 is encoded without respect to any previous frames, that frames 1 and 2 are both encoded with respect to frame 0, and that frames 3 and 4 are both encoded with respect to frame 2.

In such a preferred embodiment, the determination of whether to encode the current frame as a key frame or a delta frame may involve a straightforward test of the frame number. If the current frame is to be encoded as a key frame (i.e., not as a delta frame) (block 906 of FIG. 9), then the current frame is encoded as a key frame (block 908). The processing implemented by NRT encoder 110 for key frame encoding is described in greater detail later in this specification in conjunction with FIG. 19.

Otherwise, if the current frame is a delta frame, then the determination (block 910) is made as to whether to encode the current delta frame as a disposable frame (block 912) or as a predicted frame (block 914). The encoding of disposable frames and predicted frames is the same except for the specification of the BS₋₋ DISPOSABLE bit 416 in the FLAGS field 304 of bitstream header 204 of video bitstream 200 as described earlier in this specification in conjunction with FIGS. 2-4. When a disposable frame is processed, NRT encoder 110 leaves the reference frame unchanged. When a predicted frame (or a key frame) is processed, NRT encoder 110 updates the reference frame based upon the current frame. The processing implemented by NRT encoder 110 for delta frame encoding is described in greater detail later in this specification in conjunction with FIGS. 12 and 13.

Those skilled in the art will understand that there are alternative and/or additional criteria for determining whether to encode a frame as a key frame or a delta frame. For example, the operating system (e.g., Microsoft® Video for Windows) may request that particular frames be encoded as key frames or delta frames. As another example, the encoder may determine to encode a particular frame as a key frame by characterizing the amount of change that occurs between the designated reference frame and the current frame and then determining whether that amount of change warrants encoding the current frame as a key frame. The characterization may be based upon some relative measure of the differences between the frames.

After the current frame is encoded, NRT encoder 110 implements the second half of the bit rate controller (block 916). The bit rate controller is described in greater detail later in this specification in conjunction with FIGS. 10 and 11.

Bit Rate Controller

Referring now to FIGS. 10 and 11, there are shown the first and second parts, respectively, of the bit rate controller implemented by NRT encoder 110 to control compressed frame bit rates, according to a preferred embodiment of the present invention. NRT encoder 110 implements the first part of the bit rate controller at the start of processing for a new video frame using parameters updated when NRT encoder 110 processed the previous video frame. NRT encoder 110 implements the second part of the bit rate controller to update those parameters for use in processing the next video frame.

Within a scene in video, variation in the amount of motion may cause problems in maintaining a target bit rate. This may cause changes in the ratios of compressed key frames to compressed delta frames, which must be accounted for in order to keep video system 100 under control. The bit rate controller adjusts the compression level for the current video frame based upon the number of bits allocated for the previous frame and the patterns of number of bits unique to a compression technique having multiple types of frames (e.g., key frames, predicted delta frames, and disposable delta frames).

The bit rate controller of NRT encoder 110 preferably uses two matrices of ratios of frame types--one that describes the behavior of the compression technique in sections of video that are well predicted by motion compensation and one that describes the behavior in sections of video that are poorly predicted by motion compensation. These matrices are used both to determine how well predicted the motion compensation frames are and to change the quantization level based upon the differences between predicted compressed sizes and actual compressed sizes. This technique compensates for changes in the properties of the input video without relying on information about the current frame.

The bit rate controller of NRT encoder 110 maintains a model of a playback buffer corresponding to the video data being encoded. In the first part of the bit rate controller (block 902 of FIG. 9), if the buffer is more than half full (block 1002 of FIG. 10), then the bit rate controller updates the current ratio of compression C based on the buffer percentage BP (block 1004) using the following equation:

    C=C * [1+(BP * 2-1).sup.4 ],                               (3)

where the buffer percentage BP is the percentage of the buffer filled. The higher the compression ratio C, the greater the compression of the current frame.

Whether or not the buffer is more than half full, the bit rate controller then updates the compression ratio C for differences between the calculated average frame size AFS and the specified target frame size TFS for the current type of frame (i.e., key, disposable, or predicted) (block 1006) using the following equation: ##EQU1## where kma and kpa are specified constants (preferably 0.20 and 1.25, respectively).

The bit rate controller then updates the compression ratio C based on the adjusted ratio b (block 1008) using the following equation:

    C=C* (1+kmd * [(b).sup.kpd -1])                            (5)

where kmd and kpd are specified constants (preferably 0.20 and 1.25, respectively).

The bit rate controller then clips the compression ratio C to be within the range 1 to 127 (block 1010). This compression ratio C is used by NRT encoder 110 in encoding the current frame whether the current frame is a key frame (block 908 of FIG. 9), a disposable frame (block 912), or a predicted frame (block 914).

After the current frame has been encoded, NRT encoder 110 implements the second part of the bit rate controller (block 916 of FIG. 9). NRT encoder 110 updates the average frame size AFS based on the compressed frame size CFS of the current frame (block 1102 of FIG. 11) using the following equation:

    AFS=kea * CFS+(1-kea) * AFS,                               (6)

where kea is a specified constant (preferably 0.20).

NRT encoder 110 then updates the current buffer size BS (i.e., the size of the used portion of the buffer) (block 1104) using the following equation:

    BS=BS+CFS-TFS,                                             (7)

where CFS is the calculated compressed frame size and TFS is the specified target frame size for the current type of frame (i.e., key, disposable, or predicted).

NRT encoder 110 then clips the current buffer size BS to be within the specified range (preferably 86,400 bytes) and computes the buffer percentage BP (i.e., the percentage of the buffer filled) (block 1106).

NRT encoder 110 then assigns a value to the adjusted ratio b (block 1108) using the following equation: ##EQU2## where CFS is the compressed frame size and TFS is the target frame size.

NRT encoder 110 then uses the adjusted ratio b to interpolate a value for the current sequence difficulty CSD, which is then clipped to be within the range 0 to 1 (block 1110). The interpolation is based upon values stored in two matrices E and H. Matrix E contains values corresponding to the compression of "easy" video frames (i.e., video frames for which motion compensation does a relatively good job of predicting the current frame). Matrix H contains values corresponding to the compression of "hard" video frames (i.e., video frames for which motion compensation does a relatively poor job of predicting the current frame). When motion compensation does a good job, the amount of compressed video data is relatively small compared to the amount of compressed video data for video frames in which motion compensation does a poor job.

A set of preferred values for matrix E is given as follows: ##EQU3## Similarly, a set of preferred values for matrix H is given as follows: ##EQU4## where K₋₋ p, D₋₋ p, or P₋₋ p is the matrix row used when the previous frame was a key, disposable, or predicted frame, respectively, and K₋₋ c, D₋₋ c, or P₋₋ c is the matrix column used when the current frame is a key, disposable, or predicted frame, respectively.

For example, if the previous frame was a key frame (K₋₋ p) and the current frame is a disposable frame (D₋₋ c), then the interpolation value from matrix E is 0.18 and the interpolation value from matrix H is 0.51. If the adjusted ratio b has a value of 0.30, then the current sequence difficulty CSD is determined using the following equation: ##EQU5## The current sequence difficulty CSD is then clipped to be within the range 0 to 1. The current sequence difficulty CSD is preferably only generated when the current frame is of a type different from the previous frame. As such, H-E will not be 0 in the denominator of the previous equation.

After NRT encoder 110 generates the current sequence difficulty CSD (block 1110), NRT encoder 110 then updates the average sequence difficulty ASD using the current sequence difficulty CSD (block 1112) using the following equation:

    ASD=ked * CSD+(1-ked) * ASD,                               (10)

where ked is a specified constant (preferably 0.40). The average sequence difficulty ASD corresponds to the difficulty of encoding the current image relative to the range from easy (matrix E) to hard (matrix H) where 0 corresponds to easy and 1 corresponds to hard.

NRT encoder 110 then updates the adjusted ratio b based on the average sequence difficulty ASD (block 1114) using the following equation: ##EQU6## where E and H are the appropriate entries from matrix E and matrix H, respectively.

NRT encoder 110 retains the values for average frame size AFS, buffer percentage BP, adjusted ratio b, and average sequence difficulty ASD for use by the bit rate controller to process the next video frame.

The values for matrices E and H listed above were derived empirically using the following procedure. The first step is to select reasonable starting values for all the adjustable parameters. These starting values may be selected from a cursory look at the behavior of the algorithm. A variety of video clips are then compressed using the compression scheme. This variety should include clips with all possible combinations of levels for the following properties:

Scene length: long (>8 seconds), medium, and short (<2 seconds);

Noise: excessive and minimal; and

Motion: small/linear (easy), large/non-linear (hard), and a mixture of easy and hard.

The following steps are then performed at least once. First, with long clips, run compressions to tune the E and H matrices. Compress both noisy clips with hard motion and clean clips with easy motion, ignoring the resulting bit rate in both cases. Observe the (third) change in compression level that is dependent on the frame types and look for trends. For example, if the compression level consistently increases for easy clips of disposable frames following key frames, then the corresponding entry in matrix E should be increased. This procedure is repeated until there are no noticeable trends in the behavior of this adjustment to the compression level. When performance is improves, increase the variety of combinations of noise and motion.

Second, with shorter clips, pay attention to the bit rate controller's reaction to scene changes. Begin by adjusting the kmd, kpd, and ked parameters. Use ked to adjust how slow reacting the system is to scene changes, use kmd to adjust how much the system should react, and use kpd to adjust the system's reaction curve. The goal of this step is to minimize the oscillations of changes in compression level caused by scene changes.

Third and last, by this point, the control should be smooth, but attention has not been paid to the bit rate controller's ability to match target data rate. Begin to adjust kma, kpa, and kea to make sure that the target bit rate is met. Use kea to adjust the system's responsiveness, use kma to adjust how much the system reacts when it does react, and use kpa to adjust the reaction curve. For this step, all types of video clips should be used.

Delta Frame Encoding

Referring now to FIG. 12, there is shown a process flow diagram of the processing implemented by NRT encoder 110 to encode each component plane (i.e., Y, U, and V) of a delta frame (i.e., either a disposable frame or a predicted frame) into the syntax of video bitstream 200, according to a preferred embodiment of the present invention.

NRT encoder 110 begins to encode a component plane by segmenting the component plane (preferably vertically) into two or more strips (block 1202 of FIG. 12). In a preferred embodiment, there is sufficient memory to process each component plane of a frame at one time. In an alternative preferred embodiment, however, where memory may be limited, each component plane is divided into two or more strips, where each strip may be processed separately.

For each strip of the current component plane, NRT encoder 110 implements motion analysis to segment the strip into regions (block 1204). During motion analysis, NRT encoder 110 determines whether each region is to be encoded using inter-frame encoding or intra-frame encoding, and designates the region accordingly. For each region to be encoded using inter-frame encoding, NRT encoder 110 also determines a motion vector to be used to encode the region with respect to the reference frame. The segmentation processing of motion analysis is described in greater detail later in this specification in conjunction with FIG. 14.

In a preferred embodiment, there is a maximum number (preferably 256) of different motion vectors that may be used to encode the regions of a component plane. If the motion analysis of block 1204 results in too many motion vectors (block 1206), then the entire current component plane is encoded using intra-frame encoding (block 1208). Otherwise, each region of the component plane is encoded as designated during motion analysis (i.e., either using inter-frame encoding or intra-frame encoding) (block 1210). Inter-frame encoding is described in greater detail later in this specification in conjunction with FIG. 13. Intra-frame encoding is described in greater detail later in this specification in conjunction with FIG. 19.

Inter-Frame Encoding

Referring now to FIG. 13, there is shown a process flow diagram of the processing implemented by NRT encoder 110 to encode a region of a component plane of a delta frame using inter-frame encoding, according to a preferred embodiment of the present invention.

NRT encoder 110 begins inter-frame encoding by performing temporal filtering on region to be encoded (block 1302 of FIG. 13). Those skilled in the art will understand that the quality of a decoded image depends on the perturbation of the decoded image from the original image. In a preferred embodiment, NRT encoder 100 performs the following temporal filtering, the extent of which depends on the original image: ##EQU7## where Q is the value of the pixel component of the current frame, P is the value of the corresponding predictor component of the reference frame (i.e., the motion compensated component value from the reference frame), and K is a specified filtering coefficient. The value of filtering coefficient K may be determined empirically. For predicted (i.e., non-disposable) delta frames, filtering coefficient K is preferably between 20 and 32 and is preferably about 26. For disposable delta frames, filtering coefficient K is preferably between 18 and 30 and is preferably about 24.

Those skilled in the art will understand that, since Q is brought closer to P, correlation is increased and the new difference D between Q and P is reduced in magnitude. Further, the amount by which the difference D is reduced depends on the original component value and there is therefore a direct correlation between extent of filtering and quality. In vector quantization, the number of bits required for coding increases with the magnitude of the differences being encoded. Since the preferred temporal filtering scheme brings differences D closer to zero, fewer bits are required to encoded the data.

Those skilled in the art will also understand that the temporal filtering scheme of the present invention may be implemented in systems other than video system 100. These other systems may encode frames using methods other than vector quantization (e.g., using transform-based coding such as DCT and wavelet encoding). It will also be understood that the temporal filtering scheme of the present invention may be implemented with or without motion compensation being implemented.

After temporal filtering, NRT encoder 110 implements quantization analysis to segment each region identified during motion analysis into cells and to assign a quantization level to each cell (block 1304). The segmentation processing of quantization analysis is described in greater detail later in this specification in conjunction with FIG. 15.

For each cell identified during quantization analysis, NRT encoder 110 selects a quantization mode for the cell and encodes each block of the cell using the selected quantization mode (block 1306). In a preferred embodiment, a block is defined as a (4×4) sub-region of a component plane.

The selection of quantization mode for inter-frame encoding a cell is based on the similarity of the pixels in the cell to each other. NRT encoder 110 generates a horizontal similarity measure S_(h) and a vertical similarity measure S_(v) for the cell, according to the following equations: ##EQU8## where f(i,j) is the motion compensated difference value corresponding to row i and column j of the cell. N and M are the vertical and horizontal dimensions of the cell, respectively.

If horizontal similarity measure S_(h) is greater than a specified threshold T₃ and if vertical similarity measure S_(v) is greater than a specified threshold T₄ and if cell height N and width M are both integer multiples of 8, then mode 10 is selected for encoding blocks of the current cell. Otherwise, if vertical similarity measure S_(v) is greater than threshold T₄ and if cell height N is an integer multiples of 8, then mode 11 is selected. Otherwise, mode 0 is selected. Modes 10, 11, and 0 are described in greater detail earlier in this specification in conjunction with Table I.

The values of thresholds T₃ and T₄ depend upon the type of frame (i.e., key, predicted, or disposable), the output buffer status, and the desired picture quality. In a preferred embodiment, T₃ and T₄ are determined using the following equation: ##EQU9## where Q is a target quality measure that is either specified or automatically adjusted by the bitrate controller of NRT encoder 110. Target quality measure Q preferably serves as an indicator of the buffer status. Constants A and C are external parameters that control the shape of the quality curve. Constant A represents the threshold value when a minimum quality is desired, while constant C represents the threshold value at an average quality. Constant A is preferably not equal to constant C. In a preferred embodiment, constants A and C have values of approximately 100 and 25, respectively.

Those skilled in the art will understand that, in alternative preferred embodiments, similarity measures S_(h) and S_(v) may be derived using functions different from those described above (e.g., functions based on absolute value of differences rather than squares of differences).

After selecting the quantization mode for the cell, NRT encoder 110 encodes each (4×4) block of the cell using inter-frame encoding according to the selected quantization modes. Those skilled in the art will understand that inter-frame encoding is based on inter-frame pixel differences, where the pixel differences are calculated by subtracting the motion compensated component values of the reference frame from the component values of the current frame.

In video bitstream 200, each (4×4) block may be represented as encoded data or designated as a skip block. A skip block designation tells a decoder of video bitstream 200 that the component values for the (4×4) block are the same component values for the corresponding block of the reconstructed previous frame (i.e., the previous frame to be displayed). NRT encoder 110 determines whether each block is a skip block. In a preferred embodiment, skip blocks are used to encode regions of only disposable delta frames. In alternative preferred embodiment, skip blocks may also be used to encode regions of predicted delta frames and/or key frames. In general, a block of the current frame is skipped if the block is similar enough to the corresponding decoded block of the previous frame. To determine whether to skip a block, NRT encoder 110 decodes the encoded block of the current frame (block 1308) and compares the resulting reconstructed block to the corresponding decoded block of the previous frame (i.e., the block to be displayed for the previous frame) (block 1310). For YUV9 data, NRT encoder 110 generates three partial error measures SAE using the following equations: ##EQU10## where SAE_(y), SAE_(v), and SAE_(u) are the partial error measures between the reconstructed block for the current frame and the displayed block for the previous frame for the Y, V, and U components, respectively. N and M are the vertical and horizontal Y-component block dimensions (i.e., each preferably 4). y_(r) (i,j), v_(r) (i,j), and u_(r) (i,j) are the reconstructed values for the Y, V, and U components of the current frame, respectively. y_(d) (i,j), v_(d) (i,j), and u_(d) (i,j) are the display values for the Y, V, and U components of the previous frame, respectively. If:

    (SAE.sub.y +A*SAE.sub.v +B*SAE.sub.u)<T,                   (19)

then NRT encoder 110 skips the current block; otherwise, the current block is not skipped. A and B are specified constants (preferably equal to 4). The threshold value T is determined according to the following equation:

    T=C * Q,                                                   (20)

where Q is the quantization level and C is a constant. The value of constant C may be selected empirically and preferably has a value of approximately 24.

Those skilled in the art will understand that, in alternative preferred embodiments, the three partial error measures SAE may be derived using functions different from those described above (e.g., functions based on squares of differences rather than absolute value of differences).

If the block is to be skipped (block 1310), then NRT encoder 110 skips the block (block 1312) by designating the block as a skip block in video bitstream 200 and discarding the encoded data. Otherwise, NRT encoder 110 saves the encoded data for the block in video bitstream 200 (block 1314). Those skilled in the art will understand that NRT encoder 110 also generates the decoded reference frames used for processing subsequent frames. The data stored in the reference frames is dictated in part by the determination of whether each block is a skip block. If it is a skip block, then the reconstructed prediction error is discarded and only the prediction is written to the reference frame.

Segmentation Using Motion Analysis

Referring now to FIG. 14, there is shown a process flow diagram of the processing implemented by NRT encoder 110 to segment a strip of a component plane of the current frame into regions using motion analysis, according to a preferred embodiment of the present invention.

NRT encoder 110 starts motion analysis by selecting the entire strip as the current region (block 1402 of FIG. 14). In a preferred embodiment, there is a specified range of sizes of regions for which NRT encoder 110 performs motion estimation and compensation, where the size of a region is based on the number of pixels within the region. Regions that are bigger than the specified maximum region size are split until they are within the range. Regions that are smaller than the specified minimum region size are not split any further.

In splitting a region during motion analysis, the region is preferably divided into two new regions where at least one of the new regions has dimensions that are integer multiples of 8. Thus, if a region having 24 columns is divided vertically, the two new regions preferably have 16 and 8 columns, respectively. The same preference for integer multiples of 8 applies to the splitting of cells during quantization analysis.

Thus, if the current region is larger than the specified maximum region size (block 1404), then the region is split across its larger dimension (block 1406). That is, if the vertical dimension of the current region is greater than the horizontal dimension, then the current region is split horizontally; otherwise, the current region is split vertically. Those skilled in the art will understand that splitting across the larger dimension is performed to avoid long, thin regions. After the splitting of block 1406, processing returns to block 1404 independently with each of the new regions selected as the current region.

If the current region is not too large, then NRT encoder 110 finds the best motion vector for the current region (block 1408) using standard motion estimation techniques. If the selected motion vector is good enough (block 1410), then NRT encoder 110 designates the current region for inter-frame encoding and motion analysis for the current region is terminated (block 1412). NRT encoder 110 determines whether the selected motion vector is good enough by characterizing how well the motion compensated data (i.e., the motion compensated data from the reference frame) matches the current region. This characterization is preferably based on determining the mean square difference between the two sets of data. If the mean square difference is less than a specified threshold (having an empirically determined value), then the motion vector is good enough.

If the motion vector is not good enough, then NRT encoder 110 determines whether the current region is too small to be split further (block 1414). If the current region is too small to split, then NRT encoder 110 determines whether the current region should be inter-frame encoded or intra-frame encoded (block 1416).

Those skilled in the art will understand a region may be predicted in two ways: by the average region value or by reference to a previous reference frame. The variance of the pixel values of the region is a measure of the uniformity of the region and therefore a measure of how well the region can be predicted based on the average region value. The mean square prediction error (i.e., the sum of the squares of the pixel differences between the region and the reference image) is a measure of the uniformity between the region and the reference frame and therefore a measure of how well the region can be predicted in reference to the reference frame.

NRT encoder 110 determines whether the current region is to be encoded using inter-frame encoding or intra-frame encoding by comparing the variance of the region to the mean square prediction error for the region. If the variance is smaller than the mean square prediction error, then NRT encoder 110 designates the current region for intra-frame encoding (block 1420). Otherwise, NRT encoder 110 designates the current region for inter-frame encoding (block 1418). In either case, motion analysis for the current region is terminated.

If the current region is not too small to be split (block 1414), then NRT encoder 110 determines whether to split the current region vertically or horizontally (block 1422). To determine how to split the current region, NRT encoder 110 divides the current region into four quadrants and determines the mean square error E_(i) for each quadrant using the motion vector selected in block 1408. NRT encoder 110 then determines a horizontal factor HF and a vertical factor VF according to the following equations:

    HF=|E.sub.0 -E.sub.1 |+|E.sub.2 -E.sub.3 |                                                (21)

and

    VF=|E.sub.0 -E.sub.2 |+|E.sub.1 -E.sub.3 |                                                (22)

where E₀ is the mean square error for the upper left quadrant, E₁ is the mean square error for the upper right quadrant, E₂ is the mean square error for the lower left quadrant, and E₃ is the mean square error for the lower right quadrant. If horizontal factor HF is less than vertical factor VF, then the current region is split horizontally (block 1424); otherwise, the current region is split vertically (block 1426). In either case, after splitting the current region, processing returns to block 1408 independently with each of the new regions selected as the current region.

Those skilled in the art will understand that other algorithms exist for segmenting component planes into regions using motion analysis. For example, the plane may be divided into minimum sized regions (e.g., (8×8) or (4×4) regions) and the best motion vector may be found for each minimum sized regions. The plane may then be segmented into regions from top down by testing the sets of motion vectors associated with each region. If the set of motion vectors for a given region are fairly uniform, then motion analysis for that region may be terminated. Otherwise, the region may be split either vertically or horizontally depending upon the corresponding subsets of motion vectors and the geometry of the region (e.g., is region getting too skinny?). Processing continues until each region either (1) is too small to be split further or (2) contains a uniform set of motion vectors.

Segmentation Using Quantization Analysis

Referring now to FIG. 15, there is shown a process flow diagram of the processing implemented by NRT encoder 110 to segment a region of a component plane of the current frame into cells using quantization analysis, according to a preferred embodiment of the present invention. The region segmented by NRT encoder 110 may be a region (to be either inter-frame encoded or intra-frame encoded) identified during motion analysis as described earlier in this specification in conjunction with FIG. 14. Depending upon the selection of values for certain control parameters, quantization analysis may split a region into cells based upon the size of the region, the contents (i.e., the component values) of the region, or both. The quantization analysis of FIG. 15 is also used to segment the strips of component planes of key frames to be intra-frame encoded.

Quantization analysis segments regions into cells with preference towards (1) detection of null cells (i.e., cells that have insignificant differences from the motion compensated predicted images, (2) detection of uniform cells, and (3) generation of cells that are more square in shape. The identification of beneficial quantization splits (e.g., by efficient detection of null cells and uniform cells) tends to reduce the bit rate of the video bitstream 200. Trying to keep cells more square tends to improve image quality by reducing quantization artifacts caused by quantization levels in rectangle that are much larger in one dimension than the other dimension.

For delta frames, NRT encoder 110 begins quantization analysis by selecting the current region identified during motion analysis as the current cell (block 1502). For key frames, NRT encoder 110 begins quantization analysis by selecting the current strip of the current component plane as the current cell (block 1502). In either case, if the current cell is too large (i.e., the current cell has more pixels than a specified maximum number of pixels) (block 1504), then NRT encoder 110 splits the cell across the larger dimension (block 1506). After the splitting of block 1506, processing returns to block 1504 independently with each of the new cell selected as the current cell.

If the current cell is not too large (block 1504), then NRT encoder 110 determines whether the current cell is too small to be split further (i.e., the current cell has fewer pixels than a specified minimum number of pixels). If the current cell is too small to be split further (block 1508), then NRT encoder 110 generates the appropriate pixel differences for the cell, determines a quantization level for the cell, and determines which (4×4) blocks of the cell may be encoded as null blocks (block 1510).

When the current cell is to be encoded using inter-frame encoding, the appropriate pixel differences are the differences between the component values in the cell and the corresponding component values (taking into account any motion compensation) from the reference frame. When the current cell is to be encoded using intra-frame encoding, the appropriate pixel differences are preferably the differences between vertically adjacent component values within the current cell. In a preferred embodiment, only blocks of a cell to be encoded using inter-frame encoding may be encoded as null blocks. Null blocks may be used, however, with intra-frame encoding in alternative preferred embodiments. After the processing of block 1510, quantization analysis for the current cell is complete.

If the current cell can be split again (block 1508), NRT encoder 110 determines whether, if the cell were split into four quadrants, each quadrant would be larger than the minimum area threshold (i.e., the minimum number of pixels for cell splitting). If all four quadrants are larger than the minimum area (block 1512), then NRT encoder 110 generates the appropriate pixel differences for each quadrant, determines a quantization level for each quadrant, and determines which (4×4) blocks of each quadrant may be encoded as null blocks (block 1514). The processing of block 1514 for quadrants is similar to the processing of block 1510 for cells, as described earlier.

If the current cell is to be encoded using inter-frame encoding, then NRT encoder 110 classifies the nullity of the four quadrants of the current cell to determine how, if at all, the current cell should be split (block 1516). Otherwise, the current cell is to be encoded using intra-frame encoding and NRT encoder 110 skips the processing of block 1516, since null blocks are preferably not allowed with intra-frame encoding.

Referring now to FIG. 16, there are shown the seven different types of quadrant nullity that may exist in a cell. A quadrant is said to be a null quadrant if every (4×4) block of the quadrant can be encoded as a null block. Those skilled in the art will understand that, if all four quadrants are null quadrants, then the entire cell is preferably encoded as a null cell. It will also be understood that, if two adjacent quadrants are both null quadrants, then the cell is preferably split into two new cells where the two null quadrants are in the same new cell so that that new cell may be encoded as a null cell.

Thus, if all of the quadrants are null quadrants (type N7 in FIG. 16), then NRT encoder 110 designates the current cell as a null cell and quantization analysis is complete for the current cell (block 1522). Otherwise, if there are two vertical null quadrants (type N3), then NRT encoder 110 splits the current cell vertically (block 1520). Similarly, if there are two horizontal null quadrants (type N4), then NRT encoder 110 splits the current cell horizontally (block 1518).

If only one of the quadrants is a null quadrant (type N2) or if there are two diagonal null quadrants (type N5) or if exactly three of the quadrants are null quadrants (type N6), then the cell is split across its larger dimension (block 1506). After the splitting according to either blocks 1520, 1518, or 1506, processing returns to block 1504 independently with each of the new cells selected as the current cell. In an alternative preferred embodiment, if only one of the quadrants is a null quadrant (type N2), then processing continues to block 1524.

If none of the quadrants are null quadrants (type N1) or if the current cell is to be encoded using intra-frame encoding, then NRT encoder 110 classifies the quantization levels of the four quadrants of the current cell to determine how, if at all, the current cell should be split (block 1524).

Referring now to FIG. 17, there are shown the six different types of quadrant quantizing that may exist in a cell. Two or more quadrants are said to match if they have the same quantization level. Those skilled in the art will understand that, if all four quadrants have the same quantization level, then the entire cell is preferably encoded using that quantization level. It will also be understood that, if two adjacent quadrants have the same quantization level, then the cell is preferably split into two new cells where the two quadrants having the same quantization level are in the same new cell so that that new cell may be encoded using the same quantization level.

Thus, if all of the quadrants have the same quantization level (type Q6 in FIG. 17), then NRT encoder 110 generates the appropriate pixel differences for the cell, determines a quantization level for the cell, and determines which (4×4) blocks of the cell may be encoded as null blocks (block 1510). After the processing of block 1510, quantization analysis for the current cell is complete.

Otherwise, if only vertical quadrants have the same quantization level (type Q2), then NRT encoder 110 splits the current cell vertically (block 1520). Similarly, if only horizontal quadrants have the same quantization level (type Q3), then NRT encoder 110 splits the current cell horizontally (block 1518).

If all four quadrants have different quantization levels (type Q1) or if exactly three of the quadrants have the same quantization level (type Q5) or if only diagonal quadrants have the same quantization level (type Q4), then the cell is split across its larger dimension (block 1506). After the splitting according to either blocks 1520, 1518, or 1506, processing returns to block 1504 independently with each of the new cell selected as the current cell.

If all of the four quadrants are not larger than the minimum area (block 1512), then NRT encoder 110 determines whether any split (either a vertical or a horizontal split) is possible. A vertical split is possible, if, after splitting the cell vertically, the two new cells are both greater than the minimum cell size. Similarly, a horizontal split is possible, if, after splitting the cell horizontally, the two new cells are both greater than the minimum cell size. If neither a vertical nor a horizontal split is possible (block 1526), then NRT encoder 110 generates the appropriate pixel differences for the cell, determines a quantization level for the cell, and determines which (4×4) blocks of the cell may be encoded as null blocks (block 1510). After the processing of block 1510, quantization analysis for the current cell is complete.

If a split is possible (block 1526), then NRT encoder 110 generates the appropriate pixel differences for each possible new cell, determines a quantization level for each possible new cell, and determines which (4×4) blocks of each possible new cell may be encoded as null blocks (block 1528). If only a vertical split is possible, then the possible new cells are only the left and right halves of the current cell. If only a horizontal split is possible, then the possible new cells are only the top and bottom halves of the current cell. If both a vertical split and a horizontal split are possible, then the possible new cells are the left, right, top, and bottom halves of the current cell.

If only one type of split is possible (i.e., either a vertical split or a horizontal split, but not both) (block 1530), then NRT encoder 110 classifies the nullity of the current cell (block 1516) and if necessary the quantizing of the current cell (block 1524). In this case, the cell is characterized in terms of the two halves. Thus, for example, when only a vertical split is possible, the nullity of the cell can only be of type N1, type N3, or type N7 of FIG. 16 and the quantizing of the cell can only of type Q2 or type Q6 of FIG. 17.

If both a horizontal split or a vertical split are possible (block 1530), then NRT encoder 110 determines which split is better (block 1532). The processing implemented by NRT encoder 110 to determine which split is better is described in greater detail later in this specification in conjunction with FIG. 18. After deciding whether to split horizontally or vertically (block 1532), NRT encoder 110 classifies the nullity of the current cell (block 1516) and if necessary the quantizing of the current cell (block 1524) in terms of the selected halves as described earlier.

Referring now to FIG. 18, there is shown a process flow diagram of the processing implemented by NRT encoder 110 to determine whether to split a cell vertically or horizontally during quantization analysis when either split is possible, but the four quadrants of the cell are not all larger than the minimum cell size, according to a preferred embodiment of the present invention. In deciding whether to split such a cell vertically or horizontally, the temporary preference is to split across the larger dimension (block 1802 of FIG. 18).

If the preferred split creates a null cell (i.e., if one or both of the resulting new cells would be a null cell) (block 1804), then the preferred split is selected (block 1814). Otherwise, if the non-preferred split creates a null cell (block 1806), then the non-preferred split is selected (block 1812). Otherwise, if the preferred split creates two new cells having different quantization levels (block 1808), then the preferred split is selected (block 1814). Otherwise, if the non-preferred split creates two new cells having different quantization levels (block 1810), then the non-preferred split is selected (block 1812). Otherwise, the preferred split is selected (block 1814).

Those skilled in the art will understand that the maximum and minimum cell size thresholds may be selected such that NRT encoder 100 implements only blocks 1502, 1504, 1506, 1508, and 1510 of FIG. 14. For example, if the maximum cell size threshold and the minimum cell size threshold are both selected to be 256, then processing of FIG. 14 will never reach block 1512.

Those skilled in the art will understand that the preferred embodiment of quantization analysis described above in conjunction with FIGS. 15-18 is a top-down approach to segmentation. Alternative preferred embodiments of quantization analysis may involve a bottom-up approach. In this bottom-up approach, a region of a component plane (or even the entire component plane) is divided into cells of a selected minimum size (e.g., 8×8). Each minimum-sized cell is then analyzed to determine whether it may be encoded as a null cell and, if not, to determine a quantization level for the cell. A binary tree structure is then generated based on the results of that analysis.

Key Frame Encoding

Referring now to FIG. 19, there is shown a process flow diagram of the processing implemented by NRT encoder 110 to encode each component plane of a key frame into the syntax of video bitstream 200, according to a preferred embodiment of the present invention. Since a key frame is encoded without reference to any previous frames, motion analysis is not used to segment key frames.

NRT encoder 110 begins key frame encoding of a component plane by segmenting the component plane into strips (block 1902 of FIG. 19). NRT encoder 110 then implements quantization analysis to segment each strip of the component plane into cells and to assign a quantization level to each cell (block 1904). The segmentation processing of quantization analysis for key frame encoding is the substantially identical to that implemented for delta frame encoding, as described in greater detail earlier in this specification in conjunction with FIG. 15.

For each cell identified during quantization analysis, NRT encoder 110 selects a quantization mode for the cell and encodes each block of the cell using the selected quantization mode (block 1906). The selection of quantization mode for intra-frame encoding a cell is similar to that implemented for inter-frame encoding, as described earlier in this specification in conjunction with FIG. 19. NRT encoder 110 generates a horizontal similarity measure S_(h) and a vertical similarity measure S_(v) for the cell, according to the following equations: ##EQU11## where f(i,j) is the original component value corresponding to row i and column j of the cell. N and M are the vertical and horizontal dimensions of the cell, respectively. If horizontal similarity measure S_(h) is greater than a specified threshold T₁ and if vertical similarity measure S_(v) is greater than a specified threshold T₂ and if cell height N and width M are both integer multiples of 8, then mode 10 is selected for encoding blocks of the current cell. Otherwise, if vertical similarity measure S_(v) is greater than threshold T₂ and if cell height N is an integer multiples of 8, then mode 3 is selected. Otherwise, mode 0 is selected. Modes 10, 3, and 0 are described in greater detail earlier in this specification in conjunction with Table I.

The values of thresholds T₁ and T₂ depend upon the type of frame (i.e., key, predicted, or disposable), the output buffer status, and the desired picture quality. In a preferred embodiment, T₁ and T₂ are determined using the same equation used to determine T₃ and T₄ for inter-frame encoding, as described earlier in this specification. Those skilled in the art will understand that, in alternative preferred embodiments, similarity measures S_(h) and S_(v) may be derived using functions different from those described above (e.g., functions based on absolute value of differences rather than squares of differences).

Filtering for Applying Low-Resolution Modes

Some of the quantization modes listed in Table I preferably involve sub-sampling before quantization. As a result, filtering is desirable to avoid aliasing. For example, in mode 3, the columns of the original component plane are filtered vertically by applying a (1,2,1) filter. A (1,3) filter is applied on the edges.

In mode 10, if the frame is a key frame, then a (1,2,1) filter is first applied to the columns of the original component plane. Then a (1,1) filter is applied to the rows of the corresponding difference plane (which results from predicting each row in the plane from the previous row). In mode 10, if the frame is a delta frame, then a (1,1) filter is applied to the rows and columns of the prediction error plane.

Similarly, in mode 11, a (1,1) filter is applied to the columns of the prediction error plane.

Tests for Forcing Null Cells and Monotone Blocks

In order to save bits, it is desirable for NRT encoder 110 to encode as null cells those cells that would naturally quantize to zeros. However, forcing null cells may result in reduced quality of the encoded image sequence at the desired bit-rate. In a preferred mode, the bit-rate controller determines null cells without actually quantizing the cells.

First, the image is divided into (8×8) regions and a quantization level is determined for each region. Then, each pixel value of the region is compared to the quantization step size to determine if the region can be forced to null. Finally, all adjacent zero regions are merged into larger cells. Similarly, all adjacent regions with the same quantization level are merged into larger cells. The binary tree of video bitstream 200 is used to describe the null cells and the quantization levels of the non-null cells. Therefore, the binary tree description is preferably considered while merging cells.

The following test is preferably used to enforce the null cells with all quantization modes in key frames and predicted frames. A region is forced to zero, if for every component value x_(i) in the region of the original frame:

    (|x.sub.i -y.sub.i |<c.sub.1 *q) or (|x.sub.i -y.sub.i |<c.sub.2 *x.sub.i)                     (25)

where y_(i) is the corresponding component value in the predicted frame, q is the quantization level step size for the region, and c₁ and c₂ are positive constants. The second part of the above test is used to ignore those pixels that can be visually tolerated. In a preferred embodiment, constants c₁ and c₂ have different values depending upon whether the current frame is a key frame or a delta frame. Constants c₁ and c₂ may be controlled by external parameters.

A similar test is preferably used to enforce (4×4) monotone blocks in modes 0, 1, 2, 3, 7, 8, and 9 of Table I. Where μ is the mean of an original (4×4) block, the block is forced to a monotone value μ, if for every component value x_(i) in the region of the original frame:

    (|x.sub.i -μ|<c.sub.3 *q) or (|x.sub.i -μ|<c.sub.4 *x.sub.i)                         (26)

where constants c₃ and c₄ are preferably positive constants that may be controlled by an external parameter.

Those skilled in the art will understand that alternative embodiments of the present invention may be based on multi-media operating systems other than Microsoft® Video for Windows and Apple® QuickTime and/or in PC environments based on processors other than Intel® x86 or Motorola® microprocessors. It will also be understood by those skilled in the art that the present invention may be used to convert data corresponding to images other than video images.

It will be further understood that various changes in the details, materials, and arrangements of the parts which have been described and illustrated in order to explain the nature of this invention may be made by those skilled in the art without departing from the principle and scope of the invention as expressed in the following claims. 

What is claimed is:
 1. A computer-implemented process for encoding image signals, comprising the steps of:(a) providing a cell of an image; (b) segmenting the cell into at least four quadrants; (c) determining whether each of the four quadrants is encodable as a null quadrant; and (d) encoding the cell in accordance with the determination of step (c), wherein step (d) comprises the steps of:(1) encoding the cell as a null cell, if all four quadrants are encodable as null quadrants (2) splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants are encodable as null quadrants; and (3) splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants are encodable as null quadrants.
 2. The process of claim 1, wherein step (d) further comprises the steps of:(4) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only one quadrant is encodable as a null quadrant; (5) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; (6) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants are encodable as null quadrants; (7) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only one quadrant is encodable as a null quadrant; (8) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; (9) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants are encodable as null quadrants; and (10) encoding the cell in accordance with the quantization levels of the four quadrants, if none of the quadrants are encodable as null quadrants.
 3. The process of claim 2, wherein step (d)(10) comprises the steps of:(i) encoding the cell as a single cell, if all four quandrants have the same quantization level; (ii) splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants have the same quantization level; (iii) splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants have the same quantization level; (iv) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; (v) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; (vi) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; (vii) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; (viii) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and (ix) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 4. The process of claim 1, wherein step (d) comprises the steps of:(1) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only one quadrant is encodable as a null quadrant; (2) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; (3) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants are encodable as null quadrants; (4) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only one quadrant is encodable as a null quadrant; (5) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; and (6) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants are encodable as null quadrants.
 5. The process of claim 1, wherein step (d) comprises the step of encoding the cell in accordance with the quantization levels of the four quadrants, if none of the quadrants are encodable as null quadrants.
 6. The process of claim 5, wherein step (d) comprises the steps of:(1) encoding the cell as a single cell, if all four quandrants have the same quantization level; (2) splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants have the same quantization level; (3) splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants have the same quantization level; (4) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; (5) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; (6) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; (7) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; (8) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and (9) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 7. An apparatus for encoding image signals, comprising:(a) means for providing a cell of an image; (b) means for segmenting the cell into at least four quadrants; (c) means for determining whether each of the four quadrants is encodable as a null quadrant; and (d) means for encoding the cell in accordance with the determination of means (c), wherein means (d) comprises:(1) means for encoding the cell as a null cell, if all four quadrants are encodable as null quadrants; (2) means for splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants are encodable as null quadrants; and (3) means for splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants are encodable as null quadrants.
 8. The apparatus of claim 7, wherein means (d) further comprises:(4) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only one quadrant is encodable as a null quadrant; (5) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; (6) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants are encodable as null quadrants; (7) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only one quadrant is encodable as a null quadrant; (8) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; (9) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants are encodable as null quadrants; and (10) means for encoding the cell in accordance with the quantization levels of the four quadrants, if none of the quadrants are encodable as null quadrants.
 9. The apparatus of claim 8, wherein means (d)(10) comprises:(i) means for encoding the cell as a single cell, if all four quandrants have the same quantization level; (ii) means for splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants have the same quantization level; (iii) means for splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants have the same quantization level; (iv) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; (v) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; (vi) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; (vii) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; (viii) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and (ix) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 10. The apparatus of claim 9, wherein the apparatus comprises a processor, the processor is electrically connected to a bus, and the bus is electrically connected to a memory device, wherein the processor comprises means (a), means (b), means (c), and means (d).
 11. The apparatus of claim 7, wherein means (d) comprises:(1) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only one quadrant is encodable as a null quadrant; (2) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; (3) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants are encodable as null quadrants; (4) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only one quadrant is encodable as a null quadrant; (5) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; and (6) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants are encodable as null quadrants.
 12. The apparatus of claim 7, wherein means (d) comprises means for encoding the cell in accordance with the quantization levels of the four quadrants, if none of the quadrants are encodable as null quadrants.
 13. The apparatus of claim 12, wherein means (d) comprises:(1) means for encoding the cell as a single cell, if all four quandrants have the same quantization level; (2) means for splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants have the same quantization level; (3) means for splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants have the same quantization level; (4) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; (5) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; (6) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; (7) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; (8) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and (9) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 14. The apparatus of claim 13, wherein the apparatus comprises a processor, the processor is electrically connected to a bus, and the bus is electrically connected to a memory device, wherein the processor comprises means (a), means (b), means (c), and means (d).
 15. A computer-implemented process for decoding encoded image signals, comprising the steps of:(a) providing encoded image signals corresponding to a cell of an image; and (b) decoding the encoded image signals, wherein the cell has been encoded by:segmenting the cell into at least four quadrants; determining whether each of the four quadrants is encodable as a null quadrant; encoding the cell as a null cell, if all four quadrants are encodable as null quadrants; splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants are encodable as null quadrants; and splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants are encodable as null quadrants.
 16. The process of claim 15, wherein the cell has been encoded by:splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only one quadrant is encodable as a null quadrant; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants are encodable as null quadrants; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only one quadrant is encodable as a null quadrant; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants are encodable as null quadrants; and encoding the cell in accordance with the quantization levels of the four quadrants, if none of the quadrants are encodable as null quadrants.
 17. The process of claim 16, wherein the cell has been encoded by:encoding the cell as a single cell, if all four quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants have the same quantization level; splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 18. The process of claim 15, wherein the cell has been encoded by:splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only one quadrant is encodable as a null quadrant; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants are encodable as null quadrants; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only one quadrant is encodable as a null quadrant; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; and splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants are encodable as null quadrants.
 19. The process of claim 15, wherein the cell has been encoded in accordance with the quantization levels of the four quadrants, if none of the quadrants are encodable as null quadrants.
 20. The process of claim 19, wherein the cell has been encoded by:encoding the cell as a single cell, if all four quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants have the same quantization level; splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 21. An apparatus for decoding encoded image signals, comprising:(a) means for providing encoded image signals corresponding to a cell of an image; and (b) means for decoding the encoded image signals, wherein the cell has been encoded by:segmenting the cell into at least four quadrants; determining whether each of the four quadrants is encodable as a null quadrant; and encoding the cell as a null cell, if all four quadrants are encodable as null quadrants; splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants are encodable as null quadrants; and splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants are encodable as null quadrants.
 22. The apparatus of claim 21, wherein the cell has been encoded by:splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only one quadrant is encodable as a null quadrant; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants are encodable as null quadrants; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only one quadrant is encodable as a null quadrant; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants are encodable as null quadrants; and encoding the cell in accordance with the quantization levels of the four quadrants, if none of the quadrants are encodable as null quadrants.
 23. The apparatus of claim 22, wherein the cell has been encoded by:encoding the cell as a single cell, if all four quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants have the same quantization level; splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 24. The apparatus of claim 23, wherein the apparatus comprises a processor, the processor is electrically connected to a bus, and the bus is electrically connected to a memory device, wherein the processor comprises means (a) and means (b).
 25. The apparatus of claim 21, wherein the cell has been encoded by:splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only one quadrant is encodable as a null quadrant; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants are encodable as null quadrants; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only one quadrant is encodable as a null quadrant; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants are encodable as null quadrants; and splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants are encodable as null quadrants.
 26. The apparatus of claim 21, wherein the cell has been encoded in accordance with the quantization levels of the four quadrants, if none of the quadrants are encodable as null quadrants.
 27. The apparatus of claim 26, wherein the cell has been encoded by:encoding the cell as a single cell, if all four quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants have the same quantization level; splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 28. The apparatus of claim 21, wherein the apparatus comprises a processor, the processor is electrically connected to a bus, and the bus is electrically connected to a memory device wherein the processor comprises means (a) and means (b).
 29. A computer-implemented process for encoding image signals, comprising the steps of:(a) providing a cell of an image; (b) segmenting the cell into at least four quadrants; (c) determining the quantization level of each of the four quadrants; and (d) encoding the cell in accordance with the determination of step (c), wherein step (d) comprises the steps of:(1) encoding the cell as a single cell, if all four quadrants have the same quantization level; (2) splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants have the same quantization level; and (3) splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants have the same quantization level.
 30. The process of claim 29, wherein step (d) further comprises the steps of:(4) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; (5) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; (6) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; (7) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; (8) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and (9) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 31. The process of claim 29, wherein step (d) comprises the steps of:(1) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; (2) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; (3) splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; (4) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; (5) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and (6) splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 32. An apparatus for encoding image signals, comprising:(a) means for providing a cell of an image; (b) means for segmenting the cell into at least four quadrants; (c) means for determining the quantization level of each of the four quadrants; and (d) means for encoding the cell in accordance with the determination of means (c), wherein means (d) comprises:(1) means for encoding the cell as a single cell, if all four quadrants have the same quantization level: (2) means for splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants have the same quantization level; and (3) means for splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants have the same quantization level.
 33. The apparatus of claim 32, wherein means (d) further comprises:(4) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; (5) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; (6) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; (7) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; (8) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and (9) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 34. The apparatus of claim 33, wherein the apparatus comprises a processor, the processor is electrically connected to a bus, and the bus is electrically connected to a memory device, wherein the processor comprises means (a), means (b), means (c), and means (d).
 35. The apparatus of claim 32, wherein means (d) comprises:(1) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; (2) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; (3) means for splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; (4) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; (5) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and (6) means for splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 36. The apparatus of claim 32, wherein the apparatus comprises a processor, the processor is electrically connected to a bus, and the bus is electrically connected to a memory device, wherein the processor comprises means (a), means (b), means (c), and means (d).
 37. A computer-implemented process for decoding encoded image signals, comprising the steps of:(a) providing encoded image signals corresponding to a cell of an image; and (b) decoding the encoded image signals, wherein the cell has been encoded by:segmenting the cell into at least four quadrants; determining the quantization level of each of the quadrants; encoding the cell as a single cell, if all four quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants have the same quantization level; and splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants have the same quantization level.
 38. The process of claim 37, wherein the cell has been encoded by:splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 39. The process of claim 37, wherein the cell has been encoded by:splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 40. An apparatus for decoding encoded image signals, comprising:(a) means for providing encoded image signals corresponding to a cell of an image; and (b) means for decoding the encoded image signals, wherein the cell has been encoded by:segmenting the cell into at least four quadrants; determining the quantization level of each of the quadrants; encoding the cell as a single cell, if all four quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if only vertically adjacent quadrants have the same quantization level; and splitting the cell horizontally into two new cells and encoding the two new cells, if only horizontally adjacent quadrants have the same quantization level.
 41. The apparatus of claim 40, wherein the cell has been encoded by:splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 42. The apparatus of claim 41, wherein the apparatus comprises a processor, the processor is electrically connected to a bus, and the bus is electrically connected to a memory device, wherein the processor comprises means (a) and means (b).
 43. The apparatus of claim 40, wherein the cell has been encoded by:splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if all four quadrants have different quantization levels; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if only diagonally adjacent quadrants have the same quantization level; splitting the cell vertically into two new cells and encoding the two new cells, if the width of the cell is greater than the height of the cell and if exactly three quadrants have the same quantization level; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if all four quadrants have different quantization levels; splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if only diagonally adjacent quadrants have the same quantization level; and splitting the cell horizontally into two new cells and encoding the two new cells, if the height of the cell is greater than the width of the cell and if exactly three quadrants have the same quantization level.
 44. The apparatus of claim 40, wherein the apparatus comprises a processor, the processor is electrically connected to a bus, and the bus is electrically connected to a memory device, wherein the processor comprises means (a) and means (b). 